小时宽带宽积下菲涅耳纹波抑制方法

针对小时宽带宽积线性调频信号时,海明内加权匹配滤波器难以有效抑制旁瓣的问题,研究了余弦幅度锐化和3次相位预失真两种减小菲涅尔纹波影响的方法,并对两种方法与传统海明内加权方法的脉压结果进行了比较,最后分析了两种方法的TB积适用性和多普勒敏感性。仿真结果表明,两种方法都能有效减小小时宽带宽积下菲涅尔纹波的影响。     

直接耦合干扰的自适应两级补偿方法

针对水下电磁探测系统对直接耦合干扰的补偿精度受限于硬件采样分辨率的问题,研究了基于自适应技术的直接耦合干扰两级补偿方法。采用高速 DSP 芯片实现直接耦合干扰补偿电路,完成直接耦合干扰的粗调补偿;提出了基于可变遗忘因子的 QRD-LS 算法,并采用基于该算法的自适应陷波器实现了直接耦合干扰的微调补偿。实验研究验证了两级补偿方法对直接耦合干扰的补偿性能。结果表明：基于可变遗忘因子的QRD-LS 算法稳定性好,收敛速度快;基于该算法的自适应两级补偿方法对直接耦合干扰的补偿精度达到10－4倍。     

Choosing arrival process models for service systems: Tests of a nonhomogeneous Poisson process

Service systems such as call centers and hospital emergency rooms typically have strongly time‐varying arrival rates. Thus, a nonhomogeneous Poisson process (NHPP) is a natural model for the arrival process in a queueing model for performance analysis. Nevertheless, it is important to perform statistical tests with service system data to confirm that an NHPP is actually appropriate, as emphasized by Brown et al. [8]. They suggested a specific statistical test based on the Kolmogorov–Smirnov (KS) statistic after exploiting the conditional‐uniform (CU) property to transform the NHPP into a sequence of i.i.d. random variables uniformly distributed on [0,1] and then performing a logarithmic transformation of the data. We investigate why it is important to perform the final data transformation and consider what form it should take. We conduct extensive simulation experiments to study the power of these alternative statistical tests. We conclude that the general approach of Brown et al. [8] is excellent, but that an alternative data transformation proposed by Lewis [22], drawing upon Durbin [10], produces a test of an NHPP test with consistently greater power. We also conclude that the KS test after the CU transformation, without any additional data transformation, tends to be best to test against alternative hypotheses that primarily differ from an NHPP only through stochastic and time dependence. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 66–90, 2014     

一种新的数组逻辑结构猜想方法

许多编译优化技术都依赖于数组的逻辑结构,然而在实际的应用中,有相当多的数组是无结构的一维数组,从而妨碍了编译器的优化工作。提出了一种新的数组逻辑结构猜想算法,它能将无结构的一维数组自动变换成具有多维逻辑结构的数组,从而使编译器的优化工作成为可能。首先给出一个引理,指出猜想后的多维数组应满足的基本性质,然后基于该引理给出了猜想数组的逻辑结构应遵循的两条基本规则,最后基于这两条基本规则给出了猜想数组逻辑结构的算法。实验结果验证了所提出的数组逻辑结构猜想算法的有效性。     

A balancing problem for mixed model assembly lines with a paced moving conveyor

We state a balancing problem for mixed model assembly lines with a paced moving conveyor as: Given the daily assembling sequence of the models, the tasks of each model, the precedence relations among the tasks, and the operations parameters of the assembly line, assign the tasks of the models to the workstations so as to minimize the total overload time. Several characteristics of the problem are investigated. A line‐balancing heuristic is proposed based on a lower bound of the total overload time. A practical procedure is provided for estimating the deviation of any given line‐balance solution from the theoretical optimum. Numerical examples are given to illustrate the methodology. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

On the uncapacitated K‐commodity network design problem with zero flow‐costs

Extending Sastry's result on the uncapacitated two‐commodity network design problem, we completely characterize the optimal solution of the uncapacitated K‐commodity network design problem with zero flow costs for the case when K = 3. By solving a set of shortest‐path problems on related graphs, we show that the optimal solutions can be found in O(n³) time when K = 3, where n is the number of nodes in the network. The algorithm depends on identifying a list of “basic patterns”; the number of basic patterns grows exponentially with K. We also show that the uncapacitated K‐commodity network design problem can be solved in O(n³) time for general K if K is fixed; otherwise, the time for solving the problem is exponential. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

ViCowel：一种支持视频组播应用的可伸缩性小波视频编码方法

WebLearning+是作者开发的基于IP组播的协同学习环境,可伸缩性视频编解码及其自适应组播传输是系统研制中的核心技术。针对WebLearning+中自适应视频组播对编解码器的要求,提出了一种基于行扫描的可伸缩性小波视频编码方法ViCowel。实验结果表明该方法对于视频组播应用具有较好的适应性。     

用FPGA实现浮点FFT处理器的研究

针对定点FFT处理器精度不高的缺点,提出了浮点格式FFT处理器的FPGA硬件实现方案。详细阐述了FFT处理器的自定制浮点格式确定、算法选择和浮点加法实现等关键技术。该处理器已投入使用,工作性能稳定,系统时钟80MHz,完成1024点FFT IFFT运算只需64μs,误差小于-80dB。     

考虑CCD噪声条件下的编码曝光最优码字搜索方法

编码曝光技术将病态的运动模糊图像复原问题转化为良态问题,寻找最优码字是编码曝光技术的关键。面向实用化目的,提出了一种考虑CCD传感器噪声的编码曝光相机最优码字搜索方法。基于仿射噪声模型对图像成像过程中的噪声成分进行了系统分析,首次从理论上分析了Raskar码字选取依据并基于复原图像信噪比增益提出了光子噪声对最优码字构造影响的解析表达式。在对实际编码曝光相机进行噪声标定的基础上,提出了最优码字搜索的准则并构造出适应度函数,采用遗传算法进行优化搜索得到最优码字。仿真图像和真实图像的复原结果证实了该方法的有效性,复原图像信噪比得到有效的提高。     

多层卫星通信网络结构设计与分析

针对单层卫星网络时延高、网络阻塞概率大等问题,研究了多层卫星网络的系统结构及其特点。结合不同轨道卫星特点,引入分层卫星网络结构,采用Walker和极轨星座覆盖带设计法,设计了多层卫星网络星座。采用"弱连接"模型作为星际链路建立的基本原则,并对星座的覆盖性能和星际链路特性进行了仿真分析,结果表明,多层卫星网络在覆盖特性和星际链路性能上更具优势。